Genetic evolution vs. function approximation: Benchmarking algorithms for architectural design optimization

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

design algorithms for doppler mti and filters (using chebyshev approximation)

0

Benchmarking Derivative-Free Optimization Algorithms

We propose data profiles as a tool for analyzing the performance of derivativefree optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and piecewise-smooth problems. Our results provide...

Approximation Algorithms for Combinatorial Optimization

In combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorithm is known that can solve all instances in polynomial time. It is also strongly believed that no polynomial algorithm is capable of doing this. Although it is very difficult to solve exactly any of the NP-hard problems, some of them are amenable to ...